静态SAT问题并行处理器的设计研究

针对SAT问题的复杂性及求解速度缓慢的问题，采用可重构器件FPGA设计，实现了静态回溯搜索算法SAT问题并行处理器，提出了研制动态SAT并行处理器的设想。     

Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans

A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is difficult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans.In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The first algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers.     

Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms.     

Modelling topology optimization problems as linear mixed 0–1 programs

This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as linear mixed 0–1 programs. The modelling approach is applied to some test problems which are solved to global optimality. Copyright © 2003 John Wiley & Sons, Ltd.     

改进遗传算法在电力系统无功优化中的应用

针对常规遗传算法（GA）的不足,提出了一种改进搜索策略的遗传算法,采取了以下改进措施：在遗传迭代中,根据种群进化过程的个体的适应值大小,对群体进行分级,对级别高的个体进行小范围的搜索,对级别低的个体在大范围内进行搜索,保证群体的多样性的同时,又留住了优良个体。将改进的遗传算法应用于电力系统无功优化,并与常规遗传算法进行了比较,结果表明改进算法在计算速度、收敛性和全局最优搜索能力都有提高。     

基于实例的检索

基于实例的推理是人工智能中一项重要推理技术,而推理的核心是检索.介绍了产品设计的相似度计算方法,以及实例特征参数权系数值的确定方法,最后给出产品设计实例库三级检索算法.     

一种基于稳健匹配准则的视频文本跟踪方法

本文首先根据文本中各个字符的颜色相似的特性,确定已知文本块的文本的颜色,利用文本的颜色信息二值化文本图像以得到文本块中的字符数、字符的尺寸和间距;其次,根据视频图像的大小和视频的播放速度确定搜索窗口的大小,并利用文本的运动信息来预测搜索窗口的位置;第三,根据在相邻两帧中具有相同内容文本的颜色相似的特性,提出了一个可以解决脉冲噪声和部分缺损或遮挡问题的稳健匹配准则来跟踪文本块;最后,确定跟踪输出的文本的颜色、尺寸和运动方式。本文方法可以很好地跟踪平移、缩小或放大、旋转、淡入淡出和部分被遮挡的水平或倾斜排列的文本,并且可以记录文本平移、旋转和缩放的速度。     

工程结构优化设计发展综述

 着重评述了工程结构优化设计研究领域从最初的尺寸优化发展到形状优化、拓扑优化的基本历程及其相关特点，并对优化设计选用的优化算法进行了归类，提出了这一领域今后仍然有待于发展的主要方面．     

IP over Optical网络联合流量工程研究

对IPoverOptical网络的流量工程进行了深入的研究。问题,给出了两种流量工程体系结构,重叠流量工程和联合流量工程,然后对这两种流量工程体系进行了比较,并给出了联合流量工程的实现框图以及需要解决的关键问题。